A Unifying View for Logic Programming with Non-Monotonic Reasoning
نویسندگان
چکیده
We provide a simple formulation of a framework where some extensions of logic programming with non-monotonic reasoning are treated uniformly, namely two kinds of negation and abduction. The resulting semantics is purely model-theoretic, and gives meaning to any non-contradictory abductive logic program. Moreover, it embeds and generalizes some existing semantics which deal with negation and abduction. The framework is equipped with a correct top-down proof procedure.
منابع مشابه
G’3-Stable Semantics and Inconsistency Semantica G3'-Estable e Inconsistencia
We present an overview on how to perform non-monotonic reasoning based on paraconsistent logics. In particular, we show that one can define a logic programming semantics based on the paraconsistent logic G’3 which is called G’3-stable semantics. This semantics defines a frame for performing non-monotonic reasoning in domains which are pervaded with vagueness and inconsistencies. In fact, we sho...
متن کاملFrom Query Answering to Satissability in Nonmonotonic Logics
We propose a unifying view of negation as failure, integrity constraints, and epistemic queries in nonmonotonic reasoning. Specii-cally, we study the relationship between satis-ability and logical implication in nonmono-tonic logics, showing that, in many nonmono-tonic formalisms, it is possible and easy to reduce logical implication to satissability. This result not only allows for establishin...
متن کاملReducing Query Answering to Satisfiability in Nonmonotonic Logics
We propose a unifying view of negation as failure, integrity constraints, and epistemic queries in nonmonotonic reasoning. Specifically, we study the relationship between satisfiability and logical implication in nonmonotonic logics, showing that, in many nonmonotonic formalisms, it is possible and easy to reduce logical implication to satisfiability. This result not only allows for establishin...
متن کاملReasoning about Minimal Belief and Negation as
We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, epistemic queries, and logic programming. We characterize the complexity and provide algorith...
متن کاملReasoning with Minimal Belief and Negation as Failure: Algorithms and Complexity
We study the computational properties of the propositional fragment of MBNF , the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, epistemic queries and logic programming. We characterize the complexity and provide algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 184 شماره
صفحات -
تاریخ انتشار 1997